Critical branching random walks with small drift
نویسندگان
چکیده
منابع مشابه
Approximating Critical Parameters of Branching Random Walks
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most m particles per site. We investigate the convergence of weak and strong critical parameters of these truncated branching random walks to the analogous parameters of the original branching random walk. As a corollary, we apply our res...
متن کاملOccupation Statistics of Critical Branching Random Walks
We consider a critical nearest neighbor branching random walk on the d−dimensional integer lattice. Denote by Vm the maximal number of particles at a single site at time m, and by Gm the event that the branching random walk survives to generation m. We show that if the offspring distribution has finite n-th moment, then in dimensions d ≥ 3, conditional on Gm, Vm = Op(m 1 n ); and if the offspri...
متن کاملBranching Random Walks
We study a generalized branching random walk where particles breed at a rate which depends on the number of neighbouring particles. Under general assumptions on the breeding rates we prove the existence of a phase where the population survives without exploding. We construct a non trivial invariant measure for this case.
متن کاملRandom Walks with Drift - a Sequential Approach
In this paper sequential monitoring schemes to detect nonparametric drifts are studied for the random walk case. The procedure is based on a kernel smoother. As a by-product we obtain the asymptotics of the Nadaraya-Watson estimator and its associated sequential partial sum process under non-standard sampling. The asymptotic behavior differs substantially from the stationary situation, if there...
متن کاملBranching Random Walks on Graphs
We study a new distributed randomized information propagation mechanism in networks that we call a branching random walk (BRW). BRW is a generalization of the well-studied “standard” random walk which is a fundamental primitive useful in a wide variety of network applications ranging from token management and load balancing to search, routing, information propagation and gossip. BRW is paramete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2010
ISSN: 0304-4149
DOI: 10.1016/j.spa.2010.05.005